Generation of Permutations by Transposition
نویسندگان
چکیده
(3) All calculations are mod m¡ so that the digits of the mixed radix representation of [x]u can be obtained using only calculations mod m¡. (4) The value x x(a) can be obtained from x x(a) = x x(a_1) 4x(°_1) x " so that the modular number x need not be remembered during the whole process. (5) The matrices (do) and (x.j) are computed preliminary to the iteration procedure and are not part of it.
منابع مشابه
Reconstruction of permutations distorted by single transposition errors
The reconstruction problem for permutations on n elements from their erroneous patterns which are distorted by transpositions is presented in this paper. It is shown that for any n ≥ 3 an unknown permutation is uniquely reconstructible from 4 distinct permutations at transposition distance at most one from the unknown permutation. The transposition distance between two permutations is defined a...
متن کاملA simple framework on sorting permutations
In this paper we present a simple framework to study various distance problems of permutations, including the transposition and block-interchange distance of permutations as well as the reversal distance of signed permutations. These problems are very important in the study of the evolution of genomes. We give a general formulation for lower bounds of the transposition and block-interchange dis...
متن کاملA 'Hot Potato' Gray Code for Permutations
We give the n! permutations of [n] = {1,2, . . . , n} a cyclic order inspired by the children’s game of Hot Potato. Our order is a transposition Gray code, meaning that consecutive permutations differ by a single transposition. Furthermore, each transposition is restricted in two ways: (1) It must transpose value n (the “hot potato”); (2) It must transpose positions that are circularly adjacent...
متن کاملA Gray code for the shelling types of the boundary of a hypercube
We consider two shellings of the boundary of the hypercube equivalent if one can be transformed into the other by an isometry of the cube. We observe that a class of indecomposable permutations, bijectively equivalent to standard double occurrence words, may be used to encode one representative from each equivalence class of the shellings of the boundary of the hypercube. These permutations thu...
متن کاملReversal and Transposition Distance of Linear Chromosomes
In recent years we are seeing increasing interest in research on mutational events acting on large portions of the chromosomes. Among these events, a reversal acts on a fragment of a chromosome reversing the order and orientation of the genes, and a transposition moves fragments from one region to another within a chromosome. In this article we analyze genomes evolving by reversals and transpos...
متن کاملOn the limits of cache-oblivious rational permutations
Permuting a vector is a fundamental primitive which arises in many applications. In particular, rational permutations, which are defined by permutations of the bits of the binary representations of the vector indices, are widely used. Matrix transposition and bit-reversal are notable examples of rational permutations. In this paper we contribute a number of results regarding the execution of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010